Spanning tree - PDFSEARCH.IO - Document Search Engine

Spanning tree
Results: 445

#	Item
11	A Constant-Factor Approximation for Stochastic Steiner Forest ∗ Anupam Gupta Amit Kumar Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2009-03-26 07:24:20 Graph theory Computational complexity theory Mathematics NP-complete problems Vertex cover Steiner tree problem Shortest path problem Linear programming Edge disjoint shortest pair algorithm Minimum bottleneck spanning tree
12	On Local Fixing Michael K¨onig and Roger Wattenhofer Computer Engineering and Networks Laboratory, ETH Zurich, 8092 Zurich, Switzerland {mikoenig, wattenhofer}@ethz.ch Fax: + Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:02 Graph theory Mathematics Computational complexity theory NP-complete problems Spanning tree Combinatorial optimization Maximal independent set Matching Connectivity Vertex cover Minimum spanning tree Leader election
13	arXiv:1602.07940v2 [physics.data-an] 6 MayThe scaling of the minimum sum of edge lengths in uniformly random trees Juan Luis Esteban1 , Ramon Ferrer-i-Cancho2 and Carlos G´ Add to Reading List Source URL: www.grupolys.org Language: English - Date: 2016-05-11 06:39:57 Graph theory NP-complete problems Spanning tree Axiom of choice Graph coloring Tree
14	Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717 Add to Reading List Source URL: bioinfo.ict.ac.cn Language: English - Date: 2014-11-28 11:05:21 Mathematics Geometry Computer science Search algorithms Discrete geometry Computational geometry Mathematical optimization Closest pair of points problem Nearest neighbor search Nearest neighbor graph K-nearest neighbors algorithm Euclidean minimum spanning tree
15	UNIFORM GRIDS: A TECHNIQUE FOR INTERSECTION DETECTION ON SERIAL AND PARALLEL MACHINES Wm. Randolph Franklin Chandrasekhar Narayanaswaml Mohan Kankanhalll Add to Reading List Source URL: mapcontext.com Language: English Parallel computing Computer science Computational complexity theory Computational geometry Randomized algorithm Sweep line algorithm Polyhedron Mathematics Spanning tree Hidden line removal Arrangement of lines
16	I/O-Efficient Algorithms for Computing Contours on a Terrain ∗ Pankaj K. Agarwal Lars Arge Add to Reading List Source URL: users.cs.duke.edu Language: English - Date: 2015-07-24 06:57:53 Graph theory Eulerian path Matching Spanning tree Graph coloring NP-complete problems
17	A Constant-Factor Approximation Algorithm for the Multicommodity Rent-or-Buy Problem Amit Kumar ∗ Anupam Gupta† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2004-09-21 15:30:36 Graph theory Mathematics Computational complexity theory NP-complete problems Combinatorial optimization Edsger W. Dijkstra Spanning tree Operations research Shortest path problem Graph Linear programming Steiner tree problem
18	1 Disk Covering Methods: improving the accuracy and speed of large-scale phylogenetic analyses 1.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 1.2 Phylogenetic ana Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-08-30 15:58:30 Graph theory Phylogenetics Computational phylogenetics Maximum parsimony Chordal graph Disk-covering method Phylogenetic tree Neighbor joining Tree Tree decomposition Minimum spanning tree
19	Learning Articulated Skeletons from Motion David A. Ross, Daniel Tarlow, and Richard S. Zemel Department of Computer Science, University of Toronto, Canada {dross,dtarlow,zemel}@cs.toronto.edu Abstract. Humans demonstra Add to Reading List Source URL: www.cs.toronto.edu Language: English - Date: 2007-08-14 20:36:06 Statistics Statistical models Mathematics Graph theory Dynamical systems Mechanics Spanning tree Structure from motion Multibody system Image segmentation Bayesian network Graphical model
20	Steiner Tree Approximation via Iterative Randomized Rounding Jaroslaw Byrka, Fabrizio Grandoni, Thomas Rothvo, Laura Sanita EPFL, Lausanne, Add to Reading List Source URL: www.math.washington.edu Language: English - Date: 2013-11-01 17:11:36 Graph theory Computational complexity theory Mathematics Spanning tree NP-complete problems Approximation algorithms Steiner tree problem Complexity classes APX Combinatorial optimization Minimum spanning tree Cut